Diophantine problems in solvable groups

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Invariant Measures for Solvable Groups and Diophantine Approximation

We show that if L is a line in the plane containing a badly approximable vector, then almost every point in L does not admit an improvement in Dirichlet’s theorem. Our proof relies on a measure classification result for certain measures invariant under a non-abelian two dimensional group on the homogeneous space SL3(R)/ SL3(Z). Using the measure classification theorem, we reprove a result of Sh...

متن کامل

The Word and Geodesic Problems in Free Solvable Groups

We study the computational complexity of the Word Problem (WP) in free solvable groups Sr,d, where r ≥ 2 is the rank and d ≥ 2 is the solvability class of the group. It is known that the Magnus embedding of Sr,d into matrices provides a polynomial time decision algorithm for WP in a fixed group Sr,d. Unfortunately, the degree of the polynomial grows together with d, so the uniform algorithm is ...

متن کامل

Problems on the geometry of finitely generated solvable groups

A survey of problems, conjectures, and theorems about quasiisometric classification and rigidity for finitely generated solvable groups.

متن کامل

Characterization of Solvable Groups and Solvable radical

We give a survey of new characterizations of finite solvable groups and the solvable radical of an arbitrary finite group which were obtained over the past decade. We also discuss generalizations of these results to some classes of infinite groups and their analogues for Lie algebras. Some open problems are discussed as well.

متن کامل

Computing in Solvable Matrix Groups

We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems unlikely for membership-testing, which subsumes the discrete-log problem. However, assuming that the primes in jGj (other than the eld characteristic) are polynomiallybounded, membership-testing and many other computat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of Mathematical Sciences

سال: 2020

ISSN: 1664-3607,1664-3615

DOI: 10.1142/s1664360720500058